On the Number of Solutions in Random Hypergraph 2-Colouring
نویسندگان
چکیده
منابع مشابه
On the Number of Solutions in Random Hypergraph 2-Colouring
We determine the limiting distribution of the logarithm of the number of satisfying assignments in the random k-uniform hypergraph 2-colouring problem in a certain density regime for all k > 3. As a direct consequence we obtain that in this regime the random colouring model is contiguous with respect to the planted model, a result that helps simplifying the transfer of statements between these ...
متن کاملOn the chromatic number of a random hypergraph
We consider the problem of k-colouring a random r-uniform hypergraph with n verticesand cn edges, where k, r, c remain constant as n → ∞. Achlioptas and Naor showed that thechromatic number of a random graph in this setting, the case r = 2, must have one of twoeasily computable values as n→∞. We give a complete generalisation of this result to randomuniform hypergraphs.
متن کاملthe impact of e-readiness on ec success in public sector in iran the impact of e-readiness on ec success in public sector in iran
acknowledge the importance of e-commerce to their countries and to survival of their businesses and in creating and encouraging an atmosphere for the wide adoption and success of e-commerce in the long term. the investment for implementing e-commerce in the public sector is one of the areas which is focused in government‘s action plan for cross-disciplinary it development and e-readiness in go...
Hypergraph Colouring and Degeneracy
A hypergraph is d-degenerate if every subhypergraph has a vertex of degree at most d. A greedy algorithm colours every such hypergraph with at most d+ 1 colours. We show that this bound is tight, by constructing an r-uniform d-degenerate hypergraph with chromatic number d + 1 for all r ≥ 2 and d ≥ 1. Moreover, the hypergraph is triangle-free, where a triangle in an r-uniform hypergraph consists...
متن کاملthe washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests
در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6029